On Parameter Choice and Iterative Convergence for Stabilised Discretisations of Advection-diffusion Problems
نویسنده
چکیده
In this work we consider the design of robust and eecient nite element approximation methods for solving advection-diiusion equations. Speciically, we consider the stabilisation of discrete approximations using uniform grids which do not resolve boundary layers, as might arise using a multi-level (or multigrid) iteration strategy to solve the discrete problem. Our analysis shows that when using SUPG (streamline-upwind) nite element methodology, there is a symbiotic relationship between`best' solution approximation and fast convergence of smoothers based on the standard GMRES iteration. We also show that stabilisation based on simple artiicial diiusion perturbation terms (an approach often advocated by multigrid practitioners) is less appealing.
منابع مشابه
Preconditioned Generalized Minimal Residual Method for Solving Fractional Advection-Diffusion Equation
Introduction Fractional differential equations (FDEs) have attracted much attention and have been widely used in the fields of finance, physics, image processing, and biology, etc. It is not always possible to find an analytical solution for such equations. The approximate solution or numerical scheme may be a good approach, particularly, the schemes in numerical linear algebra for solving ...
متن کاملA Domain Decomposition Method Based on Weighted Interior Penalties for Advection-Diffusion-Reaction Problems
We propose a domain decomposition method for advection-diffusionreaction equations based on Nitsche’s transmission conditions. The advection dominated case is stabilized using a continuous interior penalty approach based on the jumps in the gradient over element boundaries. We prove the convergence of the finite element solutions of the discrete problem to the exact solution and we propose a pa...
متن کاملNonlinear Advection Problems and Overlapping Schwarz Waveform Relaxation
We analyze the convergence behavior of the overlapping Schwarz waveform relaxation algorithm applied to nonlinear advection problems. We show for Burgers’ equation that the algorithm converges super-linearly at a rate which is asymptotically comparable to the rate of the algorithm applied to linear advection problems. The convergence rate depends on the overlap and the length of the time interv...
متن کاملGeneralized iterative methods for solving double saddle point problem
In this paper, we develop some stationary iterative schemes in block forms for solving double saddle point problem. To this end, we first generalize the Jacobi iterative method and study its convergence under certain condition. Moreover, using a relaxation parameter, the weighted version of the Jacobi method together with its convergence analysis are considered. Furthermore, we extend a method...
متن کاملApproximation of stochastic advection diffusion equations with finite difference scheme
In this paper, a high-order and conditionally stable stochastic difference scheme is proposed for the numerical solution of $rm Ithat{o}$ stochastic advection diffusion equation with one dimensional white noise process. We applied a finite difference approximation of fourth-order for discretizing space spatial derivative of this equation. The main properties of deterministic difference schemes,...
متن کامل